The leftmost column of ordered Chinese restaurant process up-down chains: intertwining and convergence

نویسندگان

چکیده

Recently there has been significant interest in constructing ordered analogues of Petrov’s two-parameter extension Ethier and Kurtz’s infinitely-many-neutral-alleles diffusion model. One method for these processes goes through taking an appropriate diffusive limit Markov chains on integer compositions called Chinese Restaurant Process up-down chains. The resulting are diffusions whose state space is the set open subsets unit interval. In this paper we begin to study nontrivial aspects order structure diffusions. particular, a certain choice parameters, take size first component describe generator limiting process. We then relate leftmost maximal subset open-set valued This challenging because function its discontinuous. Our methods based establishing intertwining relations between study.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes 18 : Chinese Restaurant Process

We begin with a proof of the ESF. This is essentially Kingman’s proof (understanding ESF was the main motivation for his introduction of the coalescent). Proof: Let Π be the partition generated by the infinite-alleles model on n sample. We call each set in Π a cluster. Assume there are k clusters. Looking backwards in time, to obtain Π it must be that each cluster undergoes a sequence of coales...

متن کامل

The Dynamic Chinese Restaurant Process via Birth and Death Processes

We develop the Dynamic Chinese Restaurant Process (DCRP) which incorporates time-evolutionary feature in dependent Dirichlet Process mixture models. This model can capture the dynamic change of mixture components, allowing clusters to emerge, vanish and vary over time. All these macroscopic changes are controlled by tracing the birth and death of every single element. We investigate the propert...

متن کامل

Hierarchical Topic Models and the Nested Chinese Restaurant Process

We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting—which of the large collection of possible trees to use? We take a Bayesian approach, generating an appropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarily large branching factors a...

متن کامل

The Nested Chinese Restaurant Process and Hierarchical Topic Models

We present the nested Chinese restaurant process (nCRP), a stochastic process which assigns probability distributions to infinitelydeep, infinitely-branching trees. We show how this stochastic process can be used as a prior distribution in a nonparametric Bayesian model of document collections. Specifically, we present an application to information retrieval in which documents are modeled as pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2022

ISSN: ['1083-6489']

DOI: https://doi.org/10.1214/22-ejp843